A Linear Criterion to sort Color Components in Images
نویسندگان
چکیده
منابع مشابه
A New Method for Eye Detection in Color Images
The problem of eye detection in face images is very important for a large number of applications ranging from face recognition to gaze tracking. In this paper we propose a new algorithm for eyes detection. First, the face region is extracted from the image by skin-color information. Second, horizontal projection in image is used to approximate region of the eye be obtained . At last, the eye ce...
متن کاملA New Method for Eye Detection in Color Images
The problem of eye detection in face images is very important for a large number of applications ranging from face recognition to gaze tracking. In this paper we propose a new algorithm for eyes detection. First, the face region is extracted from the image by skin-color information. Second, horizontal projection in image is used to approximate region of the eye be obtained . At last, the eye ce...
متن کاملHash sort: A linear time complexity multiple-dimensional sort algorithm
Sorting and hashing are two completely different concepts in computer science, and appear mutually exclusive to one another. Hashing is a search method using the data as a key to map to the location within memory, and is used for rapid storage and retrieval. Sorting is a process of organizing data from a random permutation into an ordered arrangement, and is a common activity performed frequent...
متن کاملFace Detection in Color Images Using Principal Components Analysis
In this paper we present a face detection algorithm for color images with complex background. We include color information into a face detection approach based on principal components analysis (PCA). A skin color probability image is generated by doing a color analysis and the PCA is performed on this new image instead of the luminance image. Experiments show that color information improves the...
متن کاملBinar Sort: A Linear Generalized Sorting Algorithm
Sorting is a common and ubiquitous activity for computers. It is not surprising that there exist a plethora of sorting algorithms. For all the sorting algorithms, it is an accepted performance limit that sorting algorithms are linearithmic or O(N lg N). The linearithmic lower bound in performance stems from the fact that the sorting algorithms use the ordering property of the data. The sorting ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ingeniería e Investigación
سال: 2017
ISSN: 2248-8723,0120-5609
DOI: 10.15446/ing.investig.v37n1.55444